Scheduling the two-machine open shop problem under resource constraints for setting the jobs
Identifieur interne : 001496 ( Main/Exploration ); précédent : 001495; suivant : 001497Scheduling the two-machine open shop problem under resource constraints for setting the jobs
Auteurs : Ammar Oulamara [France] ; Djamal Rebaine [Canada] ; Mehdi Serairi [France]Source :
- Annals of Operations Research [ 0254-5330 ] ; 2013-12-01.
English descriptors
- KwdEn :
- mix :
Abstract
Abstract: This paper addresses the problem of open shop scheduling on two machines with resources constraints. In the context of our study, in order to be executed, a job requires first, for its preparation for a given period of time, a number of resources which cannot exceed a given resource capacity. Then, it goes onto its execution while the resources allocated to it become available again. We seek a schedule that minimizes the makespan. We first prove the $\mathcal{N}\mathcal{P}$ -hardness of several versions of this problem. Then, we present a well solvable case, lower bounds, and heuristic algorithms along with an experimental study.
Url:
- https://api.istex.fr/ark:/67375/VQC-ZNBKGHSJ-F/fulltext.pdf
- https://hal.archives-ouvertes.fr/hal-00920988
DOI: 10.1007/s10479-013-1446-9
Affiliations:
- Canada, France
- Grand Est, Hauts-de-France, Lorraine (région), Picardie
- Compiègne, Vandœuvre-lès-Nancy
- Université de Lorraine
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002279
- to stream Istex, to step Curation: 002248
- to stream Istex, to step Checkpoint: 000122
- to stream Hal, to step Corpus: 004397
- to stream Hal, to step Curation: 004397
- to stream Hal, to step Checkpoint: 000E14
- to stream Main, to step Merge: 001508
- to stream Main, to step Curation: 001496
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Scheduling the two-machine open shop problem under resource constraints for setting the jobs</title><author><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name></author><author><name sortKey="Rebaine, Djamal" sort="Rebaine, Djamal" uniqKey="Rebaine D" first="Djamal" last="Rebaine">Djamal Rebaine</name></author><author><name sortKey="Serairi, Mehdi" sort="Serairi, Mehdi" uniqKey="Serairi M" first="Mehdi" last="Serairi">Mehdi Serairi</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:94AEB3599D6E165D6E4B793762D8A05ABA48665D</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/s10479-013-1446-9</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-ZNBKGHSJ-F/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002279</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002279</idno><idno type="wicri:Area/Istex/Curation">002248</idno><idno type="wicri:Area/Istex/Checkpoint">000122</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000122</idno><idno type="wicri:doubleKey">0254-5330:2013:Oulamara A:scheduling:the:two</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-00920988</idno><idno type="url">https://hal.archives-ouvertes.fr/hal-00920988</idno><idno type="wicri:Area/Hal/Corpus">004397</idno><idno type="wicri:Area/Hal/Curation">004397</idno><idno type="wicri:Area/Hal/Checkpoint">000E14</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000E14</idno><idno type="wicri:doubleKey">0254-5330:2013:Oulamara A:scheduling:the:two</idno><idno type="wicri:Area/Main/Merge">001508</idno><idno type="wicri:Area/Main/Curation">001496</idno><idno type="wicri:Area/Main/Exploration">001496</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Scheduling the two-machine open shop problem under resource constraints for setting the jobs</title><author><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LORIA–UMR 7503, Université de Lorraine, Campus Scientifique, BP 239, 54506, Vandoeuvre-les-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName><orgName type="university">Université de Lorraine</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Rebaine, Djamal" sort="Rebaine, Djamal" uniqKey="Rebaine D" first="Djamal" last="Rebaine">Djamal Rebaine</name><affiliation wicri:level="1"><country xml:lang="fr">Canada</country><wicri:regionArea>Département d’Informatique et Mathématique, Université du Québec à Chicoutimi, G7H 2B1, Saguenay, Québec</wicri:regionArea><wicri:noRegion>Québec</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Canada</country></affiliation></author><author><name sortKey="Serairi, Mehdi" sort="Serairi, Mehdi" uniqKey="Serairi M" first="Mehdi" last="Serairi">Mehdi Serairi</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>Heudiasyc, CNRS UMR 7253, Université de Technologie de Compiègne, Rue Roger Couttolenc CS, 60319 60203, Compiègne CEDEX</wicri:regionArea><placeName><region type="region" nuts="2">Hauts-de-France</region><region type="old region" nuts="2">Picardie</region><settlement type="city">Compiègne</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Annals of Operations Research</title><title level="j" type="abbrev">Ann Oper Res</title><idno type="ISSN">0254-5330</idno><idno type="eISSN">1572-9338</idno><imprint><publisher>Springer US; http://www.springer-ny.com</publisher><pubPlace>Boston</pubPlace><date type="published" when="2013-12-01">2013-12-01</date><biblScope unit="volume">211</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="333">333</biblScope><biblScope unit="page" to="356">356</biblScope></imprint><idno type="ISSN">0254-5330</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0254-5330</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Complexity</term><term>Heuristics</term><term>Lower bounds</term><term>Makespan</term><term>Open shop</term><term>Resource requirement</term><term>Scheduling</term></keywords><keywords scheme="mix" xml:lang="en"><term>Complexity</term><term>Heuristics</term><term>Lower bounds</term><term>Makespan</term><term>Open shop</term><term>Resource requirement</term><term>Scheduling</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper addresses the problem of open shop scheduling on two machines with resources constraints. In the context of our study, in order to be executed, a job requires first, for its preparation for a given period of time, a number of resources which cannot exceed a given resource capacity. Then, it goes onto its execution while the resources allocated to it become available again. We seek a schedule that minimizes the makespan. We first prove the $\mathcal{N}\mathcal{P}$ -hardness of several versions of this problem. Then, we present a well solvable case, lower bounds, and heuristic algorithms along with an experimental study.</div></front></TEI><affiliations><list><country><li>Canada</li><li>France</li></country><region><li>Grand Est</li><li>Hauts-de-France</li><li>Lorraine (région)</li><li>Picardie</li></region><settlement><li>Compiègne</li><li>Vandœuvre-lès-Nancy</li></settlement><orgName><li>Université de Lorraine</li></orgName></list><tree><country name="France"><region name="Grand Est"><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name></region><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name><name sortKey="Serairi, Mehdi" sort="Serairi, Mehdi" uniqKey="Serairi M" first="Mehdi" last="Serairi">Mehdi Serairi</name><name sortKey="Serairi, Mehdi" sort="Serairi, Mehdi" uniqKey="Serairi M" first="Mehdi" last="Serairi">Mehdi Serairi</name></country><country name="Canada"><noRegion><name sortKey="Rebaine, Djamal" sort="Rebaine, Djamal" uniqKey="Rebaine D" first="Djamal" last="Rebaine">Djamal Rebaine</name></noRegion><name sortKey="Rebaine, Djamal" sort="Rebaine, Djamal" uniqKey="Rebaine D" first="Djamal" last="Rebaine">Djamal Rebaine</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001496 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001496 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:94AEB3599D6E165D6E4B793762D8A05ABA48665D
|texte= Scheduling the two-machine open shop problem under resource constraints for setting the jobs
}}
| This area was generated with Dilib version V0.6.33. |  |